ON BOUNDEDNESS WITH SPEED λ IN ULTRAMETRIC FIELDS
نویسندگان
چکیده
In the present paper, K denotes a complete, non-trivially valued, ultrametric (or non-archimedean) field. Entries of sequences, infinite series and matrices are in K. Following Kangro [2, 3, 4], we introduce concept boundedness with speed λ or λ-boundedness. We then obtain characterization matrix class (mλ , mµ ), where mλ set all λ-bounded sequences conclude paper remark about (c c λ-convergent
منابع مشابه
Kac-Moody groups over ultrametric fields
The Kac-Moody groups studied here are the minimal (=algebraic) and split ones, as introduced by J. Tits in [8]. When they are defined over an ultrametric field, it seems natural to associate to them some analogues of the Bruhat-Tits buildings. Actually I came to this problem when I was trying to build new buildings of nondiscrete type. If G is a Kac-Moody group over an ultrametric field K, I wa...
متن کاملon some bayesian statistical models in actuarial science with emphasis on claim count
چکیده ندارد.
15 صفحه اولH Boundedness of Determinants of Vector Fields
We consider multilinear operators T (f1, . . . , fl) given by determinants of matrices of the form (Xkfj)1≤j,k≤l, where the Xk’s are C∞ vector fields on Rn. We give conditions on the Xk’s so that the corresponding operator T map products of Lebesgue spaces L p1×· · ·×Lpl into some anisotropic space H1, when 1 p1 + · · · + 1 pl = 1. 0. Introduction and statement of results. A well known Theorem ...
متن کاملconstruction of vector fields with positive lyapunov exponents
in this thesis our aim is to construct vector field in r3 for which the corresponding one-dimensional maps have certain discontinuities. two kinds of vector fields are considered, the first the lorenz vector field, and the second originally introced here. the latter have chaotic behavior and motivate a class of one-parameter families of maps which have positive lyapunov exponents for an open in...
15 صفحه اولOn Ultrametric Algorithmic Information
How best to quantify the information of an object, whether natural or artifact, is a problem of wide interest. A related problem is the computability of an object. We present practical examples of a new way to address this problem. By giving an appropriate representation to our objects, based on a hierarchical coding of information, we exemplify how it is remarkably easy to compute complex obje...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Facta Universitatis
سال: 2022
ISSN: ['1820-6425', '1820-6417']
DOI: https://doi.org/10.22190/fumi211031045p